Use of a Quantum Computer to do Importance and Metropolis-Hastings Sampling of a Classical Bayesian Network
نویسنده
چکیده
Importance sampling and Metropolis-Hastings sampling (of which Gibbs sampling is a special case) are two methods commonly used to sample multi-variate probability distributions (that is, Bayesian networks). Heretofore, the sampling of Bayesian networks has been done on a conventional “classical computer”. In this paper, we propose methods for doing importance sampling and Metropolis-Hastings sampling of a classical Bayesian network on a quantum computer.
منابع مشابه
Approximating Bayes Estimates by Means of the Tierney Kadane, Importance Sampling and Metropolis-Hastings within Gibbs Methods in the Poisson-Exponential Distribution: A Comparative Study
Here, we work on the problem of point estimation of the parameters of the Poisson-exponential distribution through the Bayesian and maximum likelihood methods based on complete samples. The point Bayes estimates under the symmetric squared error loss (SEL) function are approximated using three methods, namely the Tierney Kadane approximation method, the importance sampling method and the Metrop...
متن کاملBayesian Estimation of Parameters in the Exponentiated Gumbel Distribution
Abstract: The Exponentiated Gumbel (EG) distribution has been proposed to capture some aspects of the data that the Gumbel distribution fails to specify. In this paper, we estimate the EG's parameters in the Bayesian framework. We consider a 2-level hierarchical structure for prior distribution. As the posterior distributions do not admit a closed form, we do an approximated inference by using ...
متن کاملData Augmentation, Frequentist Estimation, and the Bayesian Analysis of Multinomial Logit Models
This article introduces a generalization of Tanner and Wong’s data augmentation algorithm which can be used when the complete data posterior distribution cannot be directly sampled. The algorithm proposes parameter values based on complete data sampling distributions of convenient frequentist estimators which ignore some information in the complete data likelihood. The proposals are filtered us...
متن کاملBayesian Inference for Irreducible Diffusion Processes Using the Pseudo-Marginal Approach
In this article we examine two relatively new MCMC methods which allow for Bayesian inference in diffusion models. First, the Monte Carlo within Metropolis (MCWM) algorithm (O’Neil, Balding, Becker, Serola and Mollison, 2000) uses an importance sampling approximation for the likelihood and yields a limiting stationary distribution that can be made arbitrarily “close” to the posterior distributi...
متن کاملLinear-Time Gibbs Sampling in Piecewise Graphical Models
Many real-world Bayesian inference problems such as preference learning or trader valuation modeling in financial markets naturally use piecewise likelihoods. Unfortunately, exact closed-form inference in the underlying Bayesian graphical models is intractable in the general case and existing approximation techniques provide few guarantees on both approximation quality and efficiency. While (Ma...
متن کامل